منابع مشابه
Abelian properties of Parry words
Abelian complexity of a word u is a function that counts the number of pairwise non-abelian-equivalent factors of u of length n. We prove that for any c-balanced Parry word u, the values of the abelian complexity function can be computed by a finite-state automaton. The proof is based on the notion of relative Parikh vectors. The approach works for any function F (n) that can be expressed in te...
متن کاملAbelian complexity of infinite words associated with quadratic Parry numbers
We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers. © 2011 Elsevier B.V. All rights reserved.
متن کاملAbelian Properties of Words
We say that two finite words u and v are abelian equivalent if and only if they have the same number of occurrences of each letter, or equivalently if they define the same Parikh vector. In this paper we investigate various abelian properties of words including abelian complexity, and abelian powers. We study the abelian complexity of the Thue-Morse word and the Tribonacci word, and answer an o...
متن کاملSome Properties of Abelian Return Words
We investigate some properties of abelian return words as recently introduced by Puzynina and Zamboni. In particular, we obtain a characterization of Sturmian words with nonzero intercept in terms of the finiteness of the set of abelian return words to all prefixes. We describe this set of abelian returns for the Fibonacci word but also for the 2-automatic Thue–Morse word. We also investigate t...
متن کاملCombinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers
We study arithmetical and combinatorial properties of β-integers for β being the root of the equation x = mx − n,m, n ∈ N,m ≥ n + 2 ≥ 3. We determine with the accuracy of ±1 the maximal number of β-fractional positions, which may arise as a result of addition of two β-integers. For the infinite word uβ coding distances between consecutive β-integers, we determine precisely also the balance. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.11.024